On Approximation Problems With Zero-Trace Matrices
ثبت نشده
چکیده
12 because the conditions formulated in Corollary 1 are satissed for the problem (??). Therefore we have for every z 2 C jjjI + zBjjj k jjjIjjj k : Hence for every unitarily invariant norm we have by the properties of the unitarily invariant norms jjI + zBjj jjIjj: This completes the proof. 2 The above considerations imply that the characterization of a zero-trace matrix by means of the problem (??) for the norm jj jj is possible if the subgradient of jjIjj is unique, because then F has to be equal to (1=jjIjj)I (see (??)). The condition tr(B) = 0 is suucient to have (B) = jjIjj for every unitarily invariant norm (see (??)). We now prove that it is also necessary if jj jj satisses the assumptions of Theorem 3.
منابع مشابه
Power Indices of Trace Zero Symmetric Boolean Matrices
The power index of a square Boolean matrix A is the least integer d such that A is a linear combination of previous nonnegative powers of A. We determine the maximum power indices for the class of n × n primitive symmetric Boolean matrices of trace zero, the class of n × n irreducible nonprimitive symmetric Boolean matrices, and the class of n×n reducible symmetric Boolean matrices of trace zer...
متن کاملA quantitative version of the commutator theorem for zero trace matrices
Let A be a m ×m complex matrix with zero trace and let ε > 0. Then there are m ×m matrices B and C such that A = [B, C] and ‖B‖‖C‖ ≤ Kεm‖A‖ where Kε depends only on ε. Moreover, the matrix B can be taken to be normal.
متن کاملConvergence theorems of iterative approximation for finding zeros of accretive operator and fixed points problems
In this paper we propose and studied a new composite iterative scheme with certain control con-ditions for viscosity approximation for a zero of accretive operator and xed points problems in areflexive Banach space with weakly continuous duality mapping. Strong convergence of the sequencefxng dened by the new introduced iterative sequence is proved. The main results improve andcomplement the co...
متن کاملA Rank Minimization Heuristic with Application to Minimum Order System Approximation
Several problems arising in control system analysis and design, such as reduced order controller synthesis, involve minimizing the rank of a matrix variable subject to linear matrix inequality (LMI) constraints. Except in some special cases, solving this rank minimization problem (globally) is very difficult. One simple and surprisingly effective heuristic, applicable when the matrix variable i...
متن کاملACC01-IEEE1584 A Rank Minimization Heuristic with Application to Minimum Order System Approximation
Several problems arising in control system analysis and design, such as reduced order controller synthesis, involve minimizing the rank of a matrix variable subject to linear matrix inequality (LMI) constraints. Except in some special cases, solving this rank minimization problem (globally) is very difficult. One simple and surprisingly effective heuristic, applicable when the matrix variable i...
متن کامل